Spectra of Monadic Second Order Sentences Sh817
نویسنده
چکیده
For a monadic sentence ψ in the finite vocabulary we show that the spectra, the set of cardinalities of models of ψ is almost periodic under reasonable conditions. The first is that every model is so called “weakly k-decomposable”. The second is that we restrict ourselves to a nice class of models constructed by some recursion. This research was supported by the Israel Science Foundation I would like to thank Alice Leonhardt for the beautiful typing. Publ. 817; Public First Typed 03/Apr/11 Latest Revision 04/Feb/6 Typeset by AMS-TEX 1
منابع مشابه
Addition Operations on The Monadic Theories of Finite Structures
The results presented in this thesis are organized in two parts, both dealing with the logical properties of finite structures. In particular we will deal with the first order and monadic theories of finite structures. The first part deals with classes of finite structures constructible by addition operations on the monadic theories of the structures. The second part deals with the first order ...
متن کاملOn spectra of sentences of monadic second order logic with counting
We show that the spectrum of a sentence φ in Counting Monadic Second Order Logic (CMSOL) using one binary relation symbol and finitely many unary relation symbols, is ultimately periodic, provided all the models of φ are of clique width at most k, for some fixed k. We prove a similar statement for arbitrary finite relational vocabularies τ and a variant of clique width for τ structures. This in...
متن کاملA Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form: there exist such that , where is a tuple of relation symbols. and is a first order formula. Fagin was also the first to study monadic NP: the class of properties expressible by existential second order sentences whe...
متن کاملOn Asymptotic Probabilities of Monadic Second Order
We propose a new, general and easy method for proving nonexistence of asymptotic probabilities of monadic second{order sentences in classes of nite structures where rst{order extension axioms hold almost surely.
متن کاملA logical approach to asymptotic combinatorics II: Monadic second-order properties
In Compton [3] we began an investigation of a general approach to asymptotic problems in combinatorics. These problems involve determining probabilities of certain properties holding in large, finite structures randomly chosen from certain classes. The properties we considered were those expressible in first order logic L,,, and the classes were those closed under disjoint unions and components...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011